A fast weighted subband adaptive algorithm
نویسندگان
چکیده
The block algorithm in [l] has illustrated significant improvement in performance over the NLMS algorithm. However, it is known that block processing algorithms have lower tracking capabilities than their sampleby-sample counterparts. The Fast Affine Projection (FAP) algorithm [2] also outperforms the NLMS with a slight increase in complexity, but involves the fast calculation of the inverse of a covariance matrix of the input data that could undermine the performance of the algorithm. In this paper, we present a sample-bysample version of the algorithm in [l] and develop a low complexity implementation of this algorithm using a similar approach to that in [2]. The new fast algorithm does not require matrix inversion thus alleviating the drawbacks of the FAP algorithm. A variable step size version of the proposed algorithm is also presented.
منابع مشابه
A Family of Variable Step-Size Normalized Subband Adaptive Filter Algorithms Using Statistics of System Impulse Response
This paper presents a new variable step-size normalized subband adaptive filter (VSS-NSAF) algorithm. The proposed algorithm uses the prior knowledge of the system impulse response statistics and the optimal step-size vector is obtained by minimizing the mean-square deviation(MSD). In comparison with NSAF, the VSS-NSAF algorithm has faster convergence speed and lower MSD. To reduce the computa...
متن کاملLOW−RESOURCE DELAYLESS SUBBAND ADAPTIVE FILTER USING WEIGHTED OVERLAP−ADD (MonAmOR1)
A delayless structure targeted for low−resource implementation is proposed to eliminate filterbank processing delays in subband adaptive filters (SAFs). Rather than using direct IFFT or polyphase filterbanks to transform the SAFs back into the time−domain, the proposed method utilizes a weighted overlap−add (WOLA) synthesis. Low−resource real−time implementations are targeted and as such do not...
متن کاملSubband Adaptive Filter Exploiting Sparsity of System
This paper presents a normalized subband adaptive filtering (NSAF) algorithm to cope with the sparsity condition of an underlying system in the context of compressive sensing. By regularizing a weighted l1-norm of the filter taps estimate onto the cost function of the NSAF and utilizing a subgradient analysis, the update recursion of the l1-norm constraint NSAF is derived. Considering two disti...
متن کاملA Band-independent Variable Step Size Proportionate Normalized Subband Adaptive Filter Algorithm
Proportionate-type normalized suband adaptive filter (PNSAF-type) algorithms are very attractive choices for echo cancellation. To further obtain both fast convergence rate and low steady-state error, in this paper, a variable step size (VSS) version of the presented improved PNSAF (IPNSAF) algorithm is proposed by minimizing the square of the noise-free a posterior subband error signals. A non...
متن کاملFast Implementation of a Subband Adaptive Algorithm for Acoustic Echo Cancellation
The block subband adaptive algorithm in [1] has illustrated significant improvement in performance over the NLMS and other frequency domain adaptive algorithms. However, it is known that block processing algorithms have lower tracking capabilities than the their sample-by-sample counterparts. The Fast Affine Projection (FAP) algorithm [2] also outperforms the NLMS with a slight increase in comp...
متن کامل